Pathing judgment on planes and spheres: Accurate intuitions about shortest paths
نویسندگان
چکیده
منابع مشابه
Shortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملShortest paths on a polyhedron, Part I: Computing shortest paths
We present an algorithm for determining the shortest path between any two points along the surface of a polyhedron which need not be convex. This algorithm also computes for any source point on the surface of a polyhedron the inward layout and the subdivision of the polyhedron which can be used for processing queries of shortest paths between the source point and any destination point. Our algo...
متن کاملFrom planes to spheres: About gravitational lens magnifications
We discuss the classic theorem according to which a gravitational lens always produces at least one image with a magnification greater than unity. This theorem seems to contradict the conservation of total flux from a lensed source. The standard solution to this paradox is based on the exact definition of the reference ‘unlensed’ situation, in which the lens mass can either be removed or smooth...
متن کاملOn Orientations and Shortest Paths
An orientation of an undirected graph is a choice of direction for each of its edges. An orientation is called ideal with respect to a given set of pairs of vertices if it does not increase the shortest-path distances between the members of any of the pairs. A polynomial-time algorithm is given for constructing an ideal orientation with respect to two given pairs and any positive edge-lengths, ...
متن کاملLines, Circles, Planes and Spheres
Let S be a set of n points in R, no three collinear and not all coplanar. If at most n−k are coplanar and n is sufficiently large, the total number of planes determined is at least 1+k ` n−k 2 ́
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2018
ISSN: 1534-7362
DOI: 10.1167/18.10.505